package Euler148;

import java.util.*;
import ReusableCode.*;

public class Pascal {
	public static void main(String[] args) {
		List<long[]> pascal = GeneralFunctions.generatePascal(100);
		Map<Long, Long> div = new HashMap<Long, Long>();
		
		for(int i = 0; i < pascal.size(); i++)
		{
			long row[] = pascal.get(i);
			
			for(int j = 0; j < row.length; j++)
			{
				long temp = row[j];
				System.out.print(temp + " ");
				
				if(temp%7==0)
				{
					div.put((long)i, temp);
				}
			}
			
			System.out.println();
		}
		
		System.out.println("\n" + div);
	}
}
